PRISM

Benchmark
Model:csma v.1 (MDP)
Parameter(s)N = 3, K = 4
Property:time_max (exp-reward)
Invocation (default)
../fix-syntax ../prism -javamaxmem 11g -cuddmaxmem 4g -heuristic speed -e 1e-6 -maxiters 1000000 csma.3-4.prism csma.props --property time_max
Execution
Walltime:9.185471057891846s
Return code:0
Relative Error:5.798481017567072e-07
Log
PRISM
=====

Version: 4.5.dev
Date: Fri Feb 26 15:10:52 CET 2021
Hostname: christopher
Memory limits: cudd=4g, java(heap)=11g
Command line: prism -javamaxmem 11g -cuddmaxmem 4g -heuristic speed -e 1e-6 -maxiters 1000000 csma.3-4.prism csma.props --property time_max

Parsing model file "csma.3-4.prism"...

Type:        MDP
Modules:     bus station1 station2 station3 
Variables:   b y1 y2 s1 x1 bc1 cd1 s2 x2 bc2 cd2 s3 x3 bc3 cd3 

Parsing properties file "csma.props"...

5 properties:
(1) "all_before_max": Pmax=? [ !"collision_max_backoff" U "all_delivered" ]
(2) "all_before_min": Pmin=? [ !"collision_max_backoff" U "all_delivered" ]
(3) "some_before": Pmin=? [ F min_backoff_after_success<K ]
(4) "time_max": R{"time"}max=? [ F "all_delivered" ]
(5) "time_min": R{"time"}min=? [ F "all_delivered" ]

---------------------------------------------------------------------

Model checking: "time_max": R{"time"}max=? [ F "all_delivered" ]

Warning: Switching to sparse engine and (backwards) Gauss Seidel (default for heuristic=speed).

Building model...

Computing reachable states...

Reachability (BFS): 135 iterations in 1.30 seconds (average 0.009607, setup 0.00)

Time for model construction: 1.566 seconds.

Type:        MDP
States:      1460287 (1 initial)
Transitions: 2396727
Choices:     1471059

Transition matrix: 75002 nodes (6 terminal), 2396727 minterms, vars: 51r/51c/13nd

Prob0E: 149 iterations in 2.27 seconds (average 0.015208, setup 0.00)

Prob1A: 1 iterations in 0.02 seconds (average 0.024000, setup 0.00)

goal = 13, inf = 0, maybe = 1460274

Computing remaining rewards...
Engine: Sparse

Building sparse matrix (transitions)... [n=1460287, nc=1471046, nnz=2396714, k=3] [38.6 MB]
Building sparse matrix (transition rewards)... [n=1460287, nc=1471046, nnz=1261384, k=3] [25.6 MB]
Creating vector for state rewards... [11.1 MB]
Creating vector for inf... [11.1 MB]
Allocating iteration vectors... [2 x 11.1 MB]
TOTAL: [108.8 MB]

Starting iterations...

Iterative method: 262 iterations in 4.92 seconds (average 0.014431, setup 1.14)

Value in the initial state: 116.81818809314093

Time for model checking: 7.258 seconds.

Result: 116.81818809314093 (value in the initial state)


Overall running time: 9.066 seconds.

---------------------------------------------------------------------

Note: There was 1 warning during computation.